Probabilistic Shaping Using 5G New Radio Polar Codes
نویسندگان
چکیده
منابع مشابه
An efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملMultiple Access for 5G New Radio: Categorization, Evaluation, and Challenges
Next generation wireless networks require massive uplink connections as well as high spectral efficiency. It is well known that, theoretically, it is not possible to achieve the sum capacity of multi-user communications with orthogonal multiple access. To meet the challenging requirements of next generation networks, researchers have explored non-orthogonal and overloaded transmission technolog...
متن کاملUsing of Polar Codes in Steganography
Steganography is the art of secret communication. Since the advent of modern steganography, in the 2000s, many approaches based on error correcting codes (Hamming, BCH, RS, STC ...) have been proposed to reduce the number of changes in the roof while inserting the maximum bit. In this paper we propose a new steganography scheme based on the polar codes. The scheme works according to two steps. ...
متن کاملA New Radio Access Stratum Security Architecture Supporting Dynamic 5G Radio Access Networks
In this paper we introduce a new, flexible radio access stratum security architecture for 5G mobile networks that supports a dynamic, flexible radio access network with multiple different security termination points for the control and user plane communication between a mobile device and the network. We describe key refreshing methods that allow to refresh user plane keys for individual radio l...
متن کاملConvolutional Polar Codes
Arikan’s Polar codes [1] attracted much attention as the first efficiently decodable and capacity achieving codes. Furthermore, Polar codes exhibit an exponentially decreasing block error probability with an asymptotic error exponent upper bounded by β < 1 2 . Since their discovery, many attempts have been made to improve the error exponent and the finite block-length performance, while keeping...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2898103